Approaches to Veriication of Hybrid Systems: a Survey Cs2108h Final Project

Hybrid systems are characterized by a mix of analog and digital inputs and outputs. We deene such systems formally as hybrid automata, and discuss how to specify interesting properties of them. A few approaches to verifying hybrid systems are outlined: reachability analysis, model-checking on nite-state approximating automata, theorem proving, and linear programming. These approaches work with hybrid automata, or some other formalism that can be converted into hybrid automata. The veriication methods are compared on a number of practical grounds, including what sort of information they provide from failed veriication runs and how they distinguish between system and environment variables in the system.